Diclib.com
Dicionário ChatGPT

Pesquisa de dicionário Soluções personalizadas

Digite uma palavra ou frase em qualquer idioma 👆

Idioma:

Tradução e análise de palavras por inteligência artificial ChatGPT

Nesta página você pode obter uma análise detalhada de uma palavra ou frase, produzida usando a melhor tecnologia de inteligência artificial até o momento:

como a palavra é usada
frequência de uso
é usado com mais frequência na fala oral ou escrita
opções de tradução de palavras
exemplos de uso (várias frases com tradução)
etimologia

O que (quem) é higher-order functions - definição

FUNCTION THAT TAKES ONE OR MORE FUNCTIONS AS AN INPUT OR THAT OUTPUTS A FUNCTION

Higher-order functions; Higher order functions; Higher order function; First order functions; Functional form; Second-order function; First-order function; First order function; Comparison of programming languages (higher-order functions); Function function

higher-order function

(HOF) A function that can take one or more functions as argument and/or return a function as its value. E.g. map in (map f l) which returns the list of results of applying function f to each of the elements of list l. See also curried function.

Higher-order thinking

EDUCATION CONCEPT ARGUING THAT SOME TYPES OF LEARNING REQUIRE MORE COGNITIVE PROCESSING BUT ALSO HAVE MORE GENERALIZED BENEFITS

Higher order thinking skills; Higher order thinking; High Order Thinking Skills

Higher-order thinking, known as higher order thinking skills (HOTS), is a concept of education reform based on learning taxonomies (such as Bloom's taxonomy). The idea is that some types of learning require more cognitive processing than others, but also have more generalized benefits.

https://en.wikipedia.org/wiki/Higher-order_thinking

Higher-order logic

FORM OF PREDICATE LOGIC THAT IS DISTINGUISHED FROM FIRST-ORDER LOGIC BY ADDITIONAL QUANTIFIERS AND, SOMETIMES, STRONGER SEMANTICS

Higher-order predicate; Higher order logic; Higher order logics; Ordered logic; Higher-order logics; High order logic; High-order logic; Order (logic); Semantics of higher-order logic

In mathematics and logic, a higher-order logic is a form of predicate logic that is distinguished from first-order logic by additional quantifiers and, sometimes, stronger semantics. Higher-order logics with their standard semantics are more expressive, but their model-theoretic properties are less well-behaved than those of first-order logic.

https://en.wikipedia.org/wiki/Higher-order_logic

Wikipédia

Higher-order function

In mathematics and computer science, a higher-order function (HOF) is a function that does at least one of the following:

takes one or more functions as arguments (i.e. a procedural parameter, which is a parameter of a procedure that is itself a procedure),
returns a function as its result.

All other functions are first-order functions. In mathematics higher-order functions are also termed operators or functionals. The differential operator in calculus is a common example, since it maps a function to its derivative, also a function. Higher-order functions should not be confused with other uses of the word "functor" throughout mathematics, see Functor (disambiguation).

In the untyped lambda calculus, all functions are higher-order; in a typed lambda calculus, from which most functional programming languages are derived, higher-order functions that take one function as argument are values with types of the form $(\tau _{1}\to \tau _{2})\to \tau _{3}$ .

https://en.wikipedia.org/wiki/Higher-order function